Logical modelling of constraints on acceptable syntactic tree forms for natural language analysis

In this paper, we present a modelling of tree filtering mechanisms in logical-based grammars. This filtering permits restriction of the excessive generative capacity of syntactic parsing grammars. In order to preserve the declarative aspect of natural language grammars, we consider syntactic parsing as a deduction process; tree filtering consists in the reduction of the allowed forms of the proof tree corresponding to the derivation process of a sentence. We also evoke a computational implementation in the framework of the Government and Binding theory.